Families of vectors with prescribed rank partition and a prescribed subfamily
نویسندگان
چکیده
منابع مشابه
Prescribed Learning of Indexed Families
This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypothesis space, the goal of this work is to investigate the case where the learner has to cope with all possible hypothesis spaces. In that sense, the prese...
متن کاملSkew codes of prescribed distance or rank
In this paper we propose two methods to produce block codes of prescribed rank or distance. Following [4, 5] we work with skew polynomial rings of automorphism type and the codes we investigate are ideals in quotients of this ring. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section. 1 Galois theory of di...
متن کاملNew identities for 7-cores with prescribed BG-rank
Let π be a partition. BG-rank(π) is defined as an alternating sum of parities of parts of π [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generating functions P n≥0 at,j(n)q , where at,j(n) denotes the number of t-cores of n with BG-rank = j. In addition, they found positive eta-quotient representations for odd t-core generating functions with extreme value...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملProof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
In 1982 Thomassen asked whether there exists an integer f(k, t) such that every strongly f(k, t)-connected tournament T admits a partition of its vertex set into t vertex classes V1, . . . , Vt such that for all i the subtournament T [Vi] induced on T by Vi is strongly k-connected. Our main result implies an affirmative answer to this question. In particular we show that f(k, t) = O(kt) suffice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00220-7